Distance Matrix and Markov Chain Based Sensor Localization in WSN

نویسندگان

چکیده

Applications based on Wireless Sensor Networks (WSN) have shown to be quite useful in monitoring a particular geographic area of interest. Relevant geometries the surrounding environment are essential establish successful WSN topology. But it is literally hard because constructing localization algorithm that tracks exact location Nodes (SN) always challenging task. In this research paper, Distance Matrix and Markov Chain (DM-MC) model presented as node technique which Estimation used identify position node. The method further employs Model (MCM) for energy optimization interference reduction. Experiments performed against two well-known models, results demonstrate proposed improves performance by using less network resources when compared existing models. Transition probability Markova chain sustain higher nodes. Finally, decrease use 31% 25%, respectively, DV-Hop CSA methods. experimental were proven Vector-Hop Algorithm (DV-HopA) Crow Search (CSA), showing DM-MC outperforms both models regarding accuracy Energy Consumption (EC). These add credibility DC-MC better employing while establishing framework.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Ins and Outs of Distance-Based WSN Localization Schemes

Localization is a fundamental problem in wireless sensor networks. In many applications, sensor location information is critical for data processing and understanding. While the global positioning system (GPS) can be used to determine mote locations, the high cost often prohibits the ubiquitous use of GPS for location estimates. The cost of GPS has motivated researchers to develop localization ...

متن کامل

On improving APIT algorithm for better localization in WSN

In Wireless Sensor Networks (WSNs), localization algorithms could be range-based or range-free. The Approximate Point in Triangle (APIT) is a range-free approach. We propose modification of the APIT algorithm and refer as modified-APIT. We select suitable triangles with appropriate distance between anchors to reduce PIT test errors (edge effect and non-uniform placement of neighbours) in APIT a...

متن کامل

Markov Chain Monte-Carlo Localization

MCL is an extremely general framework for localization that can be used with almost any sort of sensor and map. Its power comes mainly from two aspects: • The use of a probability model that reformulates the problem of global localization as a tractable local conditional probability. This allows position information to be gleaned from sensor inputs that at any given time provide only very vague...

متن کامل

Distance-Based Distributed Multihop Localization in Mobile Wireless Sensor Networks

Localization in wireless sensor networks has been a big challenge for researchers in the past years. Besides physical problems like estimating the distance between two nodes, applicable algorithms are still on the list of open research issues. While single-hop localization with direct connection to fixed anchors is well researched, the localization with fixed anchors over a multihop route is st...

متن کامل

Sensor Localization from Distance and Orientation Constraints

The sensor localization problem can be formalized using distance and orientation constraints, typically in 3D. Local methods can be used to refine an initial location estimation, but in many cases such estimation is not available and a method able to determine all the feasible solutions from scratch is necessary. Unfortunately, existing methods able to find all the solutions in distance space c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers, materials & continua

سال: 2022

ISSN: ['1546-2218', '1546-2226']

DOI: https://doi.org/10.32604/cmc.2022.023634